Remarks on the Born approximation and the Factorization Method

In this paper, we compare the far-field operators for the full nonlinear inverse scattering problem with the Born approximation as its linearization. The Factorization Method shows that both operators share the same behavior with respect to illposedness of the inverse problem. The results are derived for acoustic and electromagnetic scattering problems and the corresponding problem in electrical impedance tomography.     

The direct and inverse problem for an inclusion within a heat-conducting layered medium

This paper is concerned with the problem of heat conduction from an inclusion in a heat transfer layered medium. Making use of the boundary integral equation method, the well-posedness of the forward problem is established by the Fredholm theory. Then an inverse boundary value problem, i.e. identifying the inclusion from the measurements of the temperature and heat flux on the accessible exterior boundary of the medium is considered in the framework of the linear sampling method. Based on a careful analysis of the Dirichlet-to-Neumann map, the mathematical fundamentals of the linear sampling method for reconstructing the inclusion are proved rigorously.     

Calderón problem for connections

In this paper, we consider the problem of identifying a connection ? on a vector bundle up to gauge equivalence from the Dirichlet-to-Neumann map of the connection Laplacian ?*? over conformally transversally anisotropic (CTA) manifolds. This was proved in [9 Dos Santos Ferreira, D., Kenig, C., Salo, M., Uhlmann, G. (2009). Limiting Carleman weights and anisotropic inverse problems. Invent. Math. 178:119–171.[Crossref], [Web of Science ®] , [Google Scholar]] for line bundles in the case of the transversal manifold being simple—we generalize this result to the case where the transversal manifold only has an injective ray transform. Moreover, the construction of suitable Gaussian beam solutions on vector bundles is given for the case of the connection Laplacian and a potential, following the works of [11 Dos Santos Ferreira, D., Kurylev, Y., Lassas, M., Salo, M. (2016). The Calderón problem in transversally anisotropic geometries. J. Eur. Math. Soc., 18:2579–2626.[Crossref], [Web of Science ®] , [Google Scholar]]. This in turn enables us to construct the Complex Geometrical Optics (CGO) solutions and prove our main uniqueness result. We also reduce the problem to a new non-abelian X-ray transform for the case of simple transversal manifolds and higher rank vector bundles. Finally, we prove the recovery of a flat connection in general from the DN map, up to gauge equivalence, using an argument relating the Cauchy data of the connection Laplacian and the holonomy.     

Nonlocal transmission problems with fractional diffusion and boundary conditions on non-smooth interfaces

We consider a transmission problem consisting of two semilinear parabolic equations involving fractional diffusion operators of different orders in a general non-smooth setting with emphasis on Lipschitz interfaces and transmission conditions along the interface. We give a unified framework for the existence and uniqueness of strong and mild solutions, and their global regularity properties.     

Disjoint Paths in Decomposable Digraphs

The k‐linkage problem is as follows: given a digraph and a collection of k terminal pairs such that all these vertices are distinct; decide whether D has a collection of vertex disjoint paths such that is from to for . A digraph is k‐linked if it has a k‐linkage for every choice of 2k distinct vertices and every choice of k pairs as above. The k‐linkage problem is NP‐complete already for [11] and there exists no function such that every ‐strong digraph has a k‐linkage for every choice of 2k distinct vertices of D [17]. Recently, Chudnovsky et al. [9] gave a polynomial algorithm for the k‐linkage problem for any fixed k in (a generalization of) semicomplete multipartite digraphs. In this article, we use their result as well as the classical polynomial algorithm for the case of acyclic digraphs by Fortune et al. [11] to develop polynomial algorithms for the k‐linkage problem in locally semicomplete digraphs and several classes of decomposable digraphs, including quasi‐transitive digraphs and directed cographs. We also prove that the necessary condition of being ‐strong is also sufficient for round‐decomposable digraphs to be k‐linked, obtaining thus a best possible bound that improves a previous one of . Finally we settle a conjecture from [3] by proving that every 5‐strong locally semicomplete digraph is 2‐linked. This bound is also best possible (already for tournaments) [1].